descendant node

英 [dɪˈsendənt nəʊd]

美 [dɪˈsendənt noʊd]

网络后继节点; 节点的后代节点; 后代节点

In this method, the descendant node under the root node of the reflecting dataset in relative-database was used to organize the contents of the descendant tree under the root node, to form data objects and establish meta database and object database.
它采用关系数据库反映数据集根节点的子节点，组织根节点的各子树内容，形成数据对象，建立元数据库和对象数据库。
The algorithms have a common problem that it needs scan descendant node list repeatedly in some cases. This leads to a large number of intermediate results, thus affecting the efficiency of the algorithm seriously.
该类算法有一个通病，即在某些情况下需要多次重复扫描后代节点列表，这导致大量中间结果产生，严重影响了算法执行效率。
The algorithm can directly determine the ancestors-descendants or parents-children relationship between potential ancestor node set and descendant node set, and do not access the real storage nodes.
算法能够根据XML/GML非空间数据索引信息直接判断潜在先辈、子孙节点集中节点间的先辈子孙（或父子）关系，而无需访问实际存储的节点。